Ordered trees and non-crossing partitions
نویسندگان
چکیده
منابع مشابه
Non-Crossing Partitions in Binary, Ordered and Motzkin Trees
Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...
متن کاملMultichains, non-crossing partitions and trees
In a previous paper El], we proved results -about the enumer;ation of certain types of chains in the non-crossing partition lattice T, and its, generalizations. In this paper we present bijections to certain classes of trees which reprove one theorem [l, Corollary 3.41 and provide a combinatoridi proof for the other [I, Theorem 5.31. We begin with a review of the definitions. A set partition X ...
متن کاملPositroids and Non-crossing Partitions
We investigate the role that non-crossing partitions play in the study of positroids, a class of matroids introduced by Postnikov. We prove that every positroid can be constructed uniquely by choosing a non-crossing partition on the ground set, and then freely placing the structure of a connected positroid on each of the blocks of the partition. This structural result yields several combinatori...
متن کاملSimply Generated Non-Crossing Partitions
We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing partitions with constraints on their block sizes. Our main tool is a bijection between non-crossing partitions and plane trees, which maps such simply generated non-c...
متن کاملGeneralized Non-Crossing Partitions and Buildings
For any finite Coxeter group W of rank n we show that the order complex of the lattice of non-crossing partitions NC(W ) embeds as a chamber subcomplex into a spherical building of type An−1. We use this to give a new proof of the fact that the non-crossing partition lattice in type An is supersolvable for all n. Moreover, we show that in case Bn, this is only the case if n < 4. We also obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90120-2